Analytic solution for the nucleolus of a three‐player cooperative game

The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

机动目标一维距离像RAT法线性化补偿

研究了机动目标宽带线性调频脉冲回波全去斜率信号模型,根据速度和加速度的调频频谱展宽特点,提出了机动目标宽带一维距离像线性化调频回波模型,给出了Radon模糊图转换(RAT)法线性参数估计与运动补偿方法,并进一步分析了测速和测距误差.仿真实验验证了RAT法一维距离像线性化参数估计与补偿,表明该方法很好地解决了运动参数未知情况下机动目标的一维距离像频谱展宽问题.     

基于分数阶傅立叶变换的ARM检测技术

分数阶傅立叶变换(FRFT)是傅立叶变换的广义形式,对线性调频(LFM)信号具有很好的能量积累作用.针对反辐射导弹(ARM)雷达回波信号的线性调频特性,提出了一种基于FRFT的反辐射导弹检测方法,并根据ARM信号的调频特性将FRFF局域化,缩小了峰值搜索区域,提高了检测效率.仿真实验表明该方法能够在高斯、非高斯分布杂波环境下有效地检测ARM信号.     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001     

稳健局部线性嵌入方法

针对局部线性嵌入方法对于噪声的敏感性,从分析噪声对数据集局部特性的影响入手,提出了稳健局部线性嵌入方法。通过与局部线性嵌入方法的理论分析和实例对比,表明稳健局部线性嵌入方法不仅对噪声影响不敏感,而且对邻域的选择有较好的适应性,可更好地挖掘数据集的本征特性,具有更强的数据可视化能力。     

动圈式永磁直线直流电机的精英保留多种群遗传优化算法

为了实现陆基无人机电磁弹射器高机动性及其直线弹射电机的高功率密度,针对动圈式永磁直线直流电机,提出精英保留的多种群遗传算法(Multi-Population Genetic Algorithm with Elite Retention, MPGAER)的电机最大功率密度优化方法。以磁通密度和电流密度为约束条件,利用其搜索能力强、收敛速度快的特点优化电机的结构参数,并与磁路法初始设计结果和传统遗传算法优化结果进行比较。结果表明:与磁路法初始设计相比,MPGAER能使电机质量减少6.25%,功率密度提高10%,电机动态性能得到提高;MPGAER优化设计的电机功率密度高于遗传算法设计结果,所提方法有效地解决了在优化过程中出现易收敛于局部最优点和寻优效果差的问题。     

An optimal recursive method for various inventory replenishment models with increasing demand and shortages

We establish various inventory replenishment policies to solve the problem of determining the timing and number of replenishments. We then analytically compare various models, and identify the best alternative among them based on minimizing total relevant costs. Furthermore, we propose a simple and computationally efficient optimal method in a recursive fashion, and provide two examples for illustration. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 791–806, 1997     

多属性决策中的线性组合赋权方法研究

权向量的确定是多属性决策中一个重要问题,线性组合赋权方法是解决该问题的一个有效途径。对线性组合赋权的求解问题进行了一般性的描述,并根据求解所用信息的不同将求解方法分为四类,阐述了每类方法常用的求解思路和原则,进一步分析了不同类别方法的特点。对求解方法进行分类,有利于对不同求解方法本质和特性的了解,可以为不同组合赋权方法的应用提供参考。     

基于线阵CCD的弹丸图像处理

分析了线阵CCD测弹丸攻角的原理,研究了线阵CCD在弹丸动态测试中的整体图像处理方法,提出一种新的方法:帧相减、局部归一化、二维自适应除噪滤波器和两重阈值复合算法的综合。该方法对复杂环境下的动态CCD图像处理特别有效。